import java.util.Stack;

public class test {



    public class Solution {
        /**
         * 代码中的类名、方法名、参数名已经指定，请勿修改，直接返回方法规定的值即可
         *
         *
         * @param pushV int整型一维数组
         * @param popV int整型一维数组
         * @return bool布尔型
         */
        public boolean IsPopOrder (int[] pushA, int[] popA) {
            // write code here
            Stack<Integer> stack = new Stack<>();
            int j = 0;
            for(int i = 0;i < pushA.length; i++){
                stack.push(pushA[i]);
                while(j < popA.length && stack.peek() == popA[j]
                && !stack.empty()){
                    stack.pop();
                    j++;
                }
            }
            //return j >= popA.length;
            return  stack.empty();
        }
    }
}
